Anonymous Fingerprinting Based on Committed Oblivious Transfer
نویسنده
چکیده
Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous fingerprinting has appeared as a technique for copyright protection which is compatible with buyer anonymity in electronic transactions. However, the complexity of known algorithms for anonymous fingerprinting deters their practical implementation, since they rely either on secure multiparty computation or on general zero-knowledge proofs. A scheme for anonymous fingerprinting based on committed oblivious transfer is presented in this paper where all computations can be performed efficiently.
منابع مشابه
How to Break COT-Based Fingerprinting Schemes and Design New One
Digital fingerprinting schemes are cryptographic methods deterring buyers from illegally redistributing digital contents. It enables sellers to identify the traitor by providing each buyer with a slight different version. What is important in designing fingerprinting scheme is to make it more practical and efficient. Recently, two oblivious transfer protocolbased schemes to consider practicalit...
متن کاملAnonymous Oblivious Transfer
In this short note we want to introduce anonymous oblivious transfer a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi party protocols with anonymous oblivious transfer. No assumption about possible collusions of cheaters or disruptors have to be made. Furthermore we shortly discus...
متن کاملCommitted Oblivious Transfer and Private Multi-Party Computation
In this paper we present an eecient protocol for \Commit-ted Oblivious Transfer" to perform oblivious transfer on committed bits: suppose Alice is committed to bits a0 and a1 and Bob is committed to b, they both want Bob to learn and commit to a b without Alice learning b nor Bob learning a b. Our protocol, based on the properties of error correcting codes, uses Bit Commitment (bc) and one-out-...
متن کاملK-anonymous Private Query Based on Blind Signature and Oblivious Transfer
In this paper, we consider a scenario where there are a group of clients and a database server, and a client wishes to query the database, but does not want to reveal her or his query to the server. Current solutions for this problem are based on oblivious transfer, which usually requires high communication overhead. To reduce the communication overhead, we propose three k-anonymous private que...
متن کاملSHADE: Secure HAmming DistancE Computation from Oblivious Transfer
We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that ar...
متن کامل